Phase Transitions and Backbones of 3-SAT and Maximum 3-SAT
نویسنده
چکیده
منابع مشابه
Exploiting a Theory of Phase Transitions in Three - Satis abilityProblemsDavid
In the past few years there have been several empirical discoveries of phase transitions in constraint satisfaction problems (CSPs), and a growth of interest in the area among the artiicial intelligence community. This paper extends a simple analytical theory of phase transitions in three-satissability (3-SAT) problems in two directions. First, a more accurate, problem-dependent calculation lea...
متن کاملExploiting a Theory of Phase Transitions in Three-Satis ability Problems
In the past few years there have been several empirical discoveries of phase transitions in constraint satisfaction problems (CSPs), and a growth of interest in the area among the artiicial intelligence community. This paper extends a simple analytical theory of phase transitions in three-satissability (3-SAT) problems in two directions. First, a more accurate, problem-dependent calculation lea...
متن کاملExploiting a Theory of Phase Transitions in Three-Satisfiability Problems
In the past few years there have been several empirical discoveries of phase transitions in constraint satisfaction problems (CSPs), and a growth of interest in the area among the arti cial intelligence community. This paper extends a simple analytical theory of phase transitions in three-satis ability (3-SAT) problems in two directions. First, a more accurate, problem-dependent calculation lea...
متن کاملxploiting a Theory of P Transitions in T ree-Satisfia
In the past few years there have been several empirical discoveries of phase transitions in constraint satisfaction problems (CSPs), and a growth of interest in the area among the artificial intelligence community. This paper extends a simple analytical theory of phase transitions in three-satisfiability (3-SAT) problems in two directions. First, a more accurate, problem-dependent calculation l...
متن کاملLocal Backbones
A backbone of a propositional CNF formula is a variable whose truth value is the same in every truth assignment that satisfies the formula. The notion of backbones for CNF formulas has been studied in various contexts. In this paper, we introduce local variants of backbones, and study the computational complexity of detecting them. In particular, we consider k-backbones, which are backbones for...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001